Debugging Product Line Programs
نویسندگان
چکیده
Software product line engineering is one approach to implement sets of related programs efficiently. Software product lines (SPLs) can be implemented by code transformations which are combined in order to generate a program. A code transformation may add functionality to a base program or may alter its structure. Though implemented with less effort, generated programs are harder to debug because debug changes must effect the SPL transformations which the program was built from. In this paper, we present a new approach to debug programs (of an SPL) generated by program transformations.
منابع مشابه
Divide and Conquer: the Quest for Compositional Design and Analysis (Dagstuhl Seminar 12511)
On December 16 to 21, the Dagstuhl seminar Divide and Conquer: the Quest for Compositional Design and Analysis was organized. Topic was the compositionality, a central theme in computer science, but its applications, methods, techniques are scattered around many different disciplines. Therefore, this workshop brought together scientists from different disciplines, including deductive verificati...
متن کاملDebugging Programs using Formal Concept Analysis
The classification of possible errors in object intents is given and some possibilities of exploring them are discussed. Two techniques for finding some types of errors in new object intents are introduced. After comparing the better technique is developed further in order to guarantee the absence of certain errors given enough information. Based on this technique an approach for debugging sour...
متن کاملDebugging Program Code Using Implicative Dependencies
Based on the technique for finding errors in new object intents a method of debugging source code is presented. This method is capable of finding strict implicative dependencies between lines of source code covered in successful and failed runs. The output is a logical expression. Using the new method it is possible to come closer to debugging programs on a logical level not checking executions...
متن کاملAutomated Debugging with Tractable Probabilistic Programming
Probabilistic programming languages allow domain experts to specify generative models in a high-level language, and reason about those models using domainindependent algorithms. Given an input, a probabilistic program generates a distribution over outputs. In this work, we instead use probabilistic programming to explicitly reason about the distribution over programs, rather than outputs. We pr...
متن کاملJustifications for Logic Programs Under Answer Set Semantics
The paper introduces the notion of off-line justification for Answer Set Programming (ASP). Justifications provide a graph-based explanation of the truth value of an atom w.r.t. a given answer set. The paper extends also this notion to provide justification of atoms during the computation of an answer set (on-line justification), and presents an integration of on-line justifications within the ...
متن کامل